finite simple groups of low rank: hurwitz generation and $(2,3)$-generation
نویسندگان
چکیده
let us consider the set of non-abelian finite simple groups which admit non-trivial irreducible projective representations of degree $le 7$ over an algebraically closed field $f$ of characteristic $pgeq 0$. we survey some recent results which lead to the complete list of the groups in this set which are $(2, 3, 7)$-generated and of those which are $(2,3)$-generated.
منابع مشابه
finite simple groups of low rank: hurwitz generation and (2,3)-generation
let us consider the set of non-abelian finite simple groups which admit non-trivial irreducible projective representations of degree $le 7$ over an algebraically closed field $mathbb{f}$ of characteristic $pgeq 0$. we survey some recent results which lead to the complete list of the groups in this set which are $(2,3,7)$-generated and of those which are $(2,3)$-generated.
متن کاملProbabilistic generation of finite simple groups, II
In earlier work it was shown that each nonabelian finite simple group G has a conjugacy class C such that, whenever 1 = x ∈G, the probability is greater than 1/10 that G= 〈x, y〉 for a random y ∈ C. Much stronger asymptotic results were also proved. Here we show that, allowing equality, the bound 1/10 can be replaced by 13/42; and, excluding an explicitly listed set of simple groups, the bound 2...
متن کاملOn Hurwitz groups of low rank
Let , 3, 7) denote the infinite triangle group, defined by the presentation X,Y | X = Y 3 = (XY ) = 1 . A non-trivial group G is said to be (2, 3, 7) -generated (or a Hurwitz group, when finite) if it is an epimorphic image of , 3, 7). Hurwitz groups are particularly interesting for the theory of Riemann surfaces. Namely, if H is the automorphism group of a compact Riemann surface of genus g > ...
متن کاملA Generation Theorem for Groups of Finite Morley Rank
We deal with two forms of the “uniqueness cases” in the classification of large simple 13 K∗-groups of finite Morley rank of odd type, where large means the 2-rank m2(G) is at least three. This substantially extends results known for even larger groups having 15 Prüfer 2-rank at least three, so as to cover the two groups PSp4 and G2. With an eye towards more distant developments, we carry out t...
متن کاملBinary Linear Codes and Symmetric Generation of Finite Simple Groups
In this paper, we study a new combinatorial method to construct decodable binary linear codes for which the automorphism groups are generated by sets of involutory symmetric generators. In this method codewords as elements of a group are represented as permutations in Sn followed by words in the n involutory symmetric generators. Transformation between elements written in symmetric representati...
متن کاملGAP Computations Concerning Probabilistic Generation of Finite Simple Groups
This is a collection of examples showing how the GAP system [GAP12] can be used to compute information about the probabilistic generation of finite almost simple groups. It includes all examples that were needed for the computational results in [BGK08]. The purpose of this writeup is twofold. On the one hand, the computations are documented this way. On the other hand, the GAP code shown for th...
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
international journal of group theoryجلد ۴، شماره ۳، صفحات ۱۳-۱۹
کلمات کلیدی
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023